On-line 3-chromatic graphs - II critical graphs
نویسندگان
چکیده
منابع مشابه
On-line 3-chromatic graphs - II critical graphs
On-line coloring of a graph is the following process. The graph is given vertex by vertex (with adjacencies to the previously given vertices) and for the actual vertex a color diierent from the colors of the neighbors must be irrevocably assigned. The on-line chromatic number of a graph G, (G) is the minimum number of colors needed to color on-line the vertices of G (when it is given in the wor...
متن کاملOn-Line 3-Chromatic Graphs I. Triangle-Free Graphs
This is the first half of a two-part paper devoted to on-line 3-colorable graphs. Here on-line 3-colorable triangle-free graphs are characterized by a finite list of forbidden induced subgraphs. The key role in our approach is played by the family of graphs which are both triangleand (2K2 + K1)-free. Characterization of this family is given by introducing a bipartite modular decomposition conce...
متن کاملEdge Chromatic 5-Critical Graphs
In this paper, we study the structure of 5-critical graphs in terms of their size. In particular, we have obtained bounds for the number of major vertices in several classes of 5-critical graphs, that are stronger than the existing bounds.
متن کاملThe locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملChromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs
In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1997
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00359-7